On Topological Machines
نویسنده
چکیده
A topological machine is a topo |ogized quas i -machine of G i n s b u r g and is defined by two cont inuous funct ions f and g, T ~ X x S ~ X , the s ta tet rans i t ion funct ion and the output funct ion, respect ively, where .X is a nonvoid T2-space, the state space, S and T are two topological semigroups , the i n p u t semigroup and the ou tpu t semigroup, respect ively, such tha t f (x, s i s 2 ) f ( f (x, sl) , s2) and g(x, s~s2) -g (x , sl) g( f (x, Sl), s~) for all x ~ X and all s l , s.~ c S. In Sect ion I of this paper some resul ts are obtained toward the s t ruc ture of the o u t p u t funct ion for a few special classes of machines and, in Section 2, some basic concepts and results of the algebraic theory are ex tended to the topological case.
منابع مشابه
Quantitative Computation by Hilbert Machines
In order to extend classical models of computing with symbols we introduce a model for quantitative computation which is based on innnite-dimensional topological linear structures. In particular machines which operate on data taken from Hilbert spaces will be looked at. These Hilbert machines (and other topological linear machines) allow the adequate treatment of concepts like innniteness and s...
متن کاملQuantitative Computation by Hilbert Machines (extended Abstract)
In order to extend classical models of computing with symbols we introduce a model for quantitative computation which is based on innnite-dimensional topological linear structures. In particular machines which operate on data taken from Hilbert spaces will be looked at. These Hilbert machines (and other topological linear machines) allow the adequate treatment of concepts like innniteness and s...
متن کاملExtracting stochastic machines from recurrent neural networks trained on complex symbolic sequences
We train recurrent neural network on a single, long, complex symbolic sequence with positive entropy. Training process is monitored through information theory based performance measures. We show that although the sequence is unpredictable, the network is able to code the sequence topological and statistical structure in recurrent neurons' activation scenarios. Such scenarios can be compactly re...
متن کاملQuasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
We describe Turing machines, tilings and in#nite words as dynamical systems and analyze some of their dynamical properties. It is known that some of these systems do not always have periodic con#gurations; we prove that they always have quasi-periodic con#gurations and we quantify quasi-periodicity. We then study the decidability of dynamical properties for these systems. In analogy to Rice’s t...
متن کاملDeep Function Machines: Generalized Neural Networks for Topological Layer Expression
In this paper we propose a generalization of deep neural networks called deep function machines (DFMs). DFMs act on vector spaces of arbitrary (possibly infinite) dimension and we show that a family of DFMs are invariant to the dimension of input data; that is, the parameterization of the model does not directly hinge on the quality of the input (eg. high resolution images). Using this generali...
متن کاملZigzags in Turing Machines
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the system, and we are interested in its complexity in terms of realtime recognition. We emphasize the class of one-head machines whose subshift can be recognized by a deterministic pushdown automaton. We prove that this class corresponds to particular restrictions on the head moveme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 14 شماره
صفحات -
تاریخ انتشار 1977